Patents, round two

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-Round AES Differentials

In this paper we study the probability of differentials and characteristics over 2 rounds of the AES with the objective to understand how the components of the AES round transformation interact. We extend and correct the analysis of the differential properties of the multiplicative inverse in GF(2) given in [17]. We show that AES has characteristics with a fixed-key probability that is many tim...

متن کامل

Secure Two-Round Message Exchange

Cryptographic protocols are an integral part of today’s communication infrastructure, where information has to be secured on various levels. The security of cryptographic protocols has been studied for decades with numerous methods, focuses, and levels of abstraction. However, no model has been developed so far that captures the specifics of message exchange protocols that only consist of two r...

متن کامل

Polylogarithmic two-round argument systems

We present a two-round argument system for NP languages with polylogarithmic communication complexity. We introduce a novel property of private information retrieval (PIR) schemes, that we call database-awareness. We construct a concrete database-aware PIR scheme and build our argument system by combining a database-aware PIR scheme with a probabilistically checkable proof system (PCP). Dwork e...

متن کامل

Patents or Patents Pending

An Aluminum Nitride (AlN) MEMS resonator technology has been developed, enabling massively parallel filter and oscillator arrays on a single chip. Low loss filter banks and resonator arrays covering the 10MHz10GHz frequency range have been demonstrated, as has monolithic integration with inductors and CMOS circuitry. The high level of integration enables miniature multi-band, spectrally-aware a...

متن کامل

Round-Optimal Secure Two-Party Computation

We consider the central cryptographic task of secure twoparty computation: two parties wish to compute some function of their private inputs (each receiving possibly different outputs) where security should hold with respect to arbitrarily-malicious behavior of either of the participants. Despite extensive research in this area, the exact roundcomplexity of this fundamental problem (i.e., the n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1992

ISSN: 0028-0836,1476-4687

DOI: 10.1038/355665b0